f=open('input.txt','r')
n,k=map(int,f.readline().split())
a=list(map(int,f.readline().split()))
f.close()
t=open('output.txt','w')
b=[]
for i in range(n):
b.append((a[i],i+1))
b.sort()
f1=open('output.txt','w')
f1.write(str(b[n-k][0])+'\n')
ans=''
for i in range(n-k,n):
ans+=str(b[i][1])+' '
f1.write(ans)
f1.close()
#include<bits/stdc++.h>
using namespace std;
typedef long long int lint;
static bool order(pair<int,int>p1,pair<int,int>p2){
return p1.first>p2.first;
}
int main(){
ifstream fin;
fin.open("input.txt");
vector<int>arr;
int a;
while(fin>>a){
arr.push_back(a);
}
int n=arr[0];
int k=arr[1];
vector<pair<int,int>>temp;
for(int i=2;i<arr.size();i++){
temp.push_back({arr[i],i-1});
}
sort(temp.begin(),temp.end(),order);
ofstream fout;
fout.open("output.txt");
if(fout){
fout<<temp[k-1].first<<endl;
for(int i=0;i<k;i++){
fout<<temp[i].second<<" ";
}
fout<<endl;
}
return 0;
}203. Remove Linked List Elements | 733. Flood Fill |
206. Reverse Linked List | 83. Remove Duplicates from Sorted List |
116. Populating Next Right Pointers in Each Node | 145. Binary Tree Postorder Traversal |
94. Binary Tree Inorder Traversal | 101. Symmetric Tree |
77. Combinations | 46. Permutations |
226. Invert Binary Tree | 112. Path Sum |
1556A - A Variety of Operations | 136. Single Number |
169. Majority Element | 119. Pascal's Triangle II |
409. Longest Palindrome | 1574A - Regular Bracket Sequences |
1574B - Combinatorics Homework | 1567A - Domino Disaster |
1593A - Elections | 1607A - Linear Keyboard |
EQUALCOIN Equal Coins | XOREQN Xor Equation |
MAKEPAL Weird Palindrome Making | HILLSEQ Hill Sequence |
MAXBRIDGE Maximise the bridges | WLDRPL Wildcard Replacement |
1221. Split a String in Balanced Strings | 1002. Find Common Characters |